Ready-Time Scheduling with Stochastic Service Times
نویسندگان
چکیده
منابع مشابه
Unrelated Machine Scheduling with Stochastic Processing Times
Two important characteristics encountered in many real-world scheduling problems are heterogeneous processors and a certain degree of uncertainty about the sizes of jobs. In this paper we address both, and study for the first time a scheduling problem that combines the classical unrelated machine scheduling model with stochastic processing times of jobs. By means of a novel time-indexed linear ...
متن کاملGrid scheduling with NBU service times
In the highly unpredictable environment of grid computing, it often makes sense to replicate the same job on several of the available servers. We prove that never replicating is optimal for a heterogeneous multi-server system in a random environment when service times are New Better than Used. © 2010 Elsevier B.V. All rights reserved.
متن کاملOptimal Scheduling Disciplines in Systems with Wait-dependent Service Times
In this paper, we consider the problem of scheduling a nite number of jobs with stochastic wait-dependent processing times. We review the literature on this topic and present some new results. In particular, for certain processing time functions, we nd the policy which stochastically minimizes the makespan of the system.
متن کاملJohnson's problem with stochastic processing times and optimal service level
Theoretical results about Johnson s problem with stochastic processing times are few. In general, just finding the expected makespan of a given sequence is already difficult, even for discrete processing time distributions. Furthermore, to obtain optimal service level we need to compute the entire distribution of the makespan. Therefore the use of heuristics and simulation is justified. We show...
متن کاملAsymptotics of Stochastic Networks with Subexponential Service Times
We analyse the tail behaviour of stationary response times in the class of open stochastic networks with renewal input admitting a representation as (max; +){linear systems. For a K-station tandem network of single server queues with innnite buuer capacity, which is one of the simplest models in this class, we rst show that if the tail of the service time distribution of one server, say server ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1997
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.45.5.779